package com.cherrish.demo.algorithm.tree;

import com.cherrish.demo.algorithm.tree.bintree.Node;

/**
 * @author cherrish
 * @time 2019-02-20 16:18
 * @name Tree
 * @desc:
 */
public interface Tree{
    Node find(int key);
    boolean insert(int key);
    boolean delete(int key);

    void infixOrder(Node node);
    void preOrder(Node node);
    void postOrder(Node node);

    Node findMin();
    Node findMax();
}
